Introducing hat graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introducing Spacial Graphs ( updated

We introduce spatial graphs through a natural extension of the concept of pla-narity in three dimensions. For a graph G=(V,E), a face is a simple cycle of edges, and a complete set of faces is such that each edge belonging to a cycle in E is on at least one face in the set. G is spatial if admits a three-dimensional representation R with a complete set of faces consisting of simple surfaces, su...

متن کامل

On Optimal Strategies for a Hat Game on Graphs

The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupies a different vertex of a graph. Either blue or red hats are placed randomly and independently on their heads. Each player sees the colors of the hats of players in neighboring vertices and no other hats (and hence, in particul...

متن کامل

The Three Colour Hat Guessing Game on Cycle Graphs

We study a cooperative game in which each member of a team of N players, wearing coloured hats and situated at the vertices of the cycle graph CN , is guessing their own hat colour merely on the basis of observing the hats worn by their two neighbours without exchanging the information. Each hat can have one of three colours. A predetermined guessing strategy is winning if it guarantees at leas...

متن کامل

Wer die Wahl hat, hat die Qual

Deutschland steht 2009 vor einem überaus schwierigen Jahr. Vorausschauende Manager schielen aber weniger auf die nicht beeinflussbaren Eckdaten, sondern finden heraus, welche Verbesserungspotenziale in ihrer Firma schlummern. Eine Alternative zu Cost-Cutting-Programmen kann die Optimierung des Projektmanagements sein. Ein kritischer Blick auf den Markt der dafür erforderlichen Projektmanagement...

متن کامل

Hat Derivatives

Stephen B Maurer ([email protected]) received his Ph.D. from Princeton in 1972, under A. W. Tucker. He is a mathematics professor at Swarthmore College, where he was also an undergraduate. He is coauthor of Discrete Algorithmic Mathematics, with Anthony Ralston. At one time he chaired the MAA high school contests, and he has written guides for undergraduates on writing mathematics. At par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cognitive Research: Principles and Implications

سال: 2019

ISSN: 2365-7464

DOI: 10.1186/s41235-019-0182-3